Correction to: Metaheuristics for Combinatorial Optimization
نویسندگان
چکیده
Correction to: S. Greco et al. (Eds.): Metaheuristics for Combinatorial Optimization, AISC 1332, https://doi.org/10.1007/978-3-030-68520-1 The book was inadvertently published with the incorrect volume number (1336) and this has been corrected now (1332).
منابع مشابه
Metaheuristics in Combinatorial Optimization
The emergence of metaheuristics for solving diÆcult combinatorial optimization problems is one of the most notable achievements of the last two decades in operations research. This paper provides an account of the most recent developments in the eld and identi es some common issues and trends. Examples of applications are also reported for vehicle routing and scheduling problems.
متن کاملMetaheuristics for dynamic combinatorial optimization problems
Many real-world optimization problems are combinatorial optimization problems subject to dynamic environments. In such dynamic combinatorial optimization problems (DCOPs), the objective, decision variables and/or constraints may change over time, and so solving DCOPs is a challenging task. Metaheuristics are a good choice of tools to tackle DCOPs because many metaheuristics are inspired by natu...
متن کاملTwo Metaheuristics for Multiobjective Stochastic Combinatorial Optimization
Two general-purpose metaheuristic algorithms for solving multiobjective stochastic combinatorial optimization problems are introduced: SP-ACO (based on the Ant Colony Optimization paradigm) which combines the previously developed algorithms S-ACO and P-ACO, and SPSA, which extends Pareto Simulated Annealing to the stochastic case. Both approaches are tested on random instances of a TSP with tim...
متن کاملHybrid metaheuristics in combinatorial optimization: A survey
Research inmetaheuristics for combinatorial optimizationproblemshas lately experienced anoteworthy shift towards the hybridization of metaheuristics with other techniques for optimization. At the same time, the focus of research has changed from being rather algorithm-oriented to being more problemoriented. Nowadays the focus is on solving the problem at hand in the best way possible, rather th...
متن کاملMetaheuristics in Stochastic Combinatorial Optimization: a Survey
Metaheuristics such as Ant Colony Optimization, Evolutionary Computation, Simulated Annealing, Tabu Search and Stochastic Partitioning Methods are introduced, and their recent applications to a wide class of combinatorial optimization problems under uncertainty are reviewed. The flexibility of metaheuristics in being adapted to different modeling approaches and problem formulations emerges clea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in intelligent systems and computing
سال: 2021
ISSN: ['2194-5357', '2194-5365']
DOI: https://doi.org/10.1007/978-3-030-68520-1_5